This lecture first adresses the problem of calculating the maximum performance of simple kernels if limited by instruction throughput. In a second stept it starts with the chapter on architecture of memory hierarchy. Here the basic structures, Hockney's law and the basic concept of cachelines and latency hiding through non-blocking memory transfers are discussed.